Representing and reasoning with classes and instances of possibly periodic events. Theory, algorithms and applications
نویسندگان
چکیده
Acknowledgements Without Chiara, the completion of this dissertation would not have been possible. I am indebted to Professor Paolo Terenziani, my advisor, who introduced me to the topic of temporal constraint-based reasoning and supported and guided me through the years in the Ph.D. program and to Professor Pietro Torasso, my tutor, for his valuable guidance. I would also like to thank the referees, Professor Thierry Vidal and Professor Abdul Sattar, for their helpful and insightful comments and suggestions.
منابع مشابه
Classification of encrypted traffic for applications based on statistical features
Traffic classification plays an important role in many aspects of network management such as identifying type of the transferred data, detection of malware applications, applying policies to restrict network accesses and so on. Basic methods in this field were using some obvious traffic features like port number and protocol type to classify the traffic type. However, recent changes in applicat...
متن کاملTemporal Reasoning with Classes and Instances of Events
Representing and reasoning with both temporal constraints between classes of events (e.g., between the types of actions needed to achieve a goal) and temporal constraints between instances of events (e.g., between the specific actions being executed) is a ubiquitous task in many areas of computer science, such as planning, workflow, guidelines and protocol management. The temporal constraints b...
متن کاملApplications of two new algorithms of cuckoo optimization (CO) and forest optimization (FO) for solving single row facility layout problem (SRFLP)
Nowadays, due to inherent complexity of real optimization problems, it has always been a challenging issue to develop a solution algorithm to these problems. Single row facility layout problem (SRFLP) is a NP-hard problem of arranging a number of rectangular facilities with varying length on one side of a straight line with aim of minimizing the weighted sum of the distance between all facility...
متن کاملIFSB-ReliefF: A New Instance and Feature Selection Algorithm Based on ReliefF
Increasing the use of Internet and some phenomena such as sensor networks has led to an unnecessary increasing the volume of information. Though it has many benefits, it causes problems such as storage space requirements and better processors, as well as data refinement to remove unnecessary data. Data reduction methods provide ways to select useful data from a large amount of duplicate, incomp...
متن کاملA Risk-averse Inventory-based Supply Chain Protection Problem with Adapted Stochastic Measures under Intentional Facility Disruptions: Decomposition and Hybrid Algorithms
Owing to rising intentional events, supply chain disruptions have been considered by setting up a game between two players, namely, a designer and an interdictor contesting on minimizing and maximizing total cost, respectively. The previous studies have found the equilibrium solution by taking transportation, penalty and restoration cost into account. To contribute further, we examine how incor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006